class Solution:
    def minArray(self, numbers: List[int]) -> int:
        # 二分
        i, j =  0, len(numbers) - 1
        while i != j:
            m = (i + j) // 2
            if numbers[m] > numbers[j]:
                i = m + 1
            elif numbers[m] < numbers[j]:
                j = m
            else: # 相等则改变范围
                j = j - 1
        return numbers[j]